A Superior Evolutionary Algorithm for 3 - SATThomas

We investigate three approaches to Boolean satissability problems. We study and compare the best heuristic algorithm WGSAT and two evolutionary algorithms, an evolution strategy and an evolutionary algorithm adapting its own tness function while running. The results show that the adaptive EA outperforms the other two approaches. The power of this EA originates from the adaptive mechanism, which is completely problem independent and generally applicable to any constraint satisfaction problem. This suggests that the adaptive EA is not only a good solver for satissability problems, but for constraint satisfaction problems in general.